The inverse 1-median problem on a cycle
نویسندگان
چکیده
منابع مشابه
The inverse 1-median problem on a cycle
Let the graph G = (V,E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changing the vertex weights at minimum cost such that a prespecified vertex becomes the 1-median. The cost is proportional to the increase or decrease of the corresponding weight. We show that this problem can be formulated as a linear...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe 1-median and 1-highway problem
In this paper we study a facility location problem in the plane in which a single point (median) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time of the clients to the facility, using the L1 or Manhattan metric. The highway is an alternative transportation system that can be used by the clients to reduce their travel time to the facility. ...
متن کاملOn the Inverse Problem for Quantum Graphs with One Cycle
Quantum graphs having one cycle are considered. It is shown that if the cycle contains at least three vertices, then the potential on the graph can be uniquely reconstructed from the corresponding Titchmarsh-Weyl function (Dirichlet-to-Neumann map) associated with graph’s boundary, provided certain non-resonant conditions are satisfied. PACS numbers: 03.65.Nk, 73.63.-b, 85.35.-p.
متن کاملRobust 1-median location problem on a tree
In combinatorial optimization, and particularly in location problems, the most used robustness criteria rely either on maximal cost or on maximal regret. However, it is well known that these criteria are too conservative. In this paper, we present a new robustness approach, called lexicographic α-robustness, which compensates for the drawbacks of the criteria based on the worst case. We apply t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2008
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.11.008